Google-bombing - Manipulating the PageRank Algorithm
نویسنده
چکیده
With the growth of the Internet, the field of Information Retrieval (IR) has gained increasing importance. Quick, easy, and accurate information access is the deciding factor between successful search companies and their rivals. Likewise, the manipulation of IR systems for ulterior motives, known as adversarial IR, is just as important, as it can turn the successes of a search strategy against itself, at the expense of the general user. In this paper, a specific form of adversarial IR known as Google-bombing is examined, regarding its implementation and the different means by which it can be combatted.
منابع مشابه
An Improved Computation of the PageRank Algorithm
The Google search site (http://www.google.com) exploits the link structure of the Web to measure the relative importance of Web pages. The ranking method implemented in Google is called PageRank [3]. The sum of all PageRank values should be one. However, we notice that the sum becomes less than one in some cases. We present an improved PageRank algorithm that computes the PageRank values of the...
متن کاملThe Second Eigenvalue of the Google Matrix
We determine analytically the modulus of the second eigenvalue for the web hyperlink matrix used by Google for computing PageRank. Specifically, we prove the following statement: “For any matrix , where is an row-stochastic matrix, is a nonnegative rank-one row-stochastic matrix, and ! " , the second eigenvalue of has modulus # $&%'#( ) . Furthermore, if has at least two irreducible closed subs...
متن کاملThe Evaluation of the Team Performance of MLB Applying PageRank Algorithm
Background. There is a weakness that the win-loss ranking model in the MLB now is calculated based on the result of a win-loss game, so we assume that a ranking system considering the opponent’s team performance is necessary. Objectives. This study aims to suggest the PageRank algorithm to complement the problem with ranking calculated with winning ratio in calculating team ranking of US MLB. ...
متن کاملPageRank Computation, with Special Attention to Dangling Nodes
Abstract. We present a simple algorithm for computing the PageRank (stationary distribution) of the stochastic Google matrix G. The algorithm lumps all dangling nodes into a single node. We express lumping as a similarity transformation of G, and show that the PageRank of the nondangling nodes can be computed separately from that of the dangling nodes. The algorithm applies the power method onl...
متن کاملFinding scientific gems with Google's PageRank algorithm
We apply the Google PageRank algorithm to assess the relative importance of all publications in the Physical Review family of journals from 1893 to 2003. While the Google number and the number of citations for each publication are positively correlated, outliers from this linear relation identify some exceptional papers or “gems” that are universally familiar to physicists. © 2006 Published by ...
متن کامل